On the reconstruction of planar graphs
نویسندگان
چکیده
We show that the planarity of a graph can be recognized from its vertex deleted subgraphs, which answers a question posed by Bondy and Hemminger in 1979. We also state some useful counting lemmas and use them to reconstruct certain planar graphs. AMS subject classification: Primary 05C60, Secondary 05C10, 05C40, 05C38
منابع مشابه
On the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملA New Approach for Quantitative Evaluation of Reconstruction Algorithms in SPECT
ABTRACT Background: In nuclear medicine, phantoms are mainly used to evaluate the overall performance of the imaging systems and practically there is no phantom exclusively designed for the evaluation of the software performance. In this study the Hoffman brain phantom was used for quantitative evaluation of reconstruction techniques. The phantom is modified to acquire t...
متن کاملAutomorphism groups , isomorphism , reconstruction ( Chapter 27 of the Handbook of Combinatorics )
1 Definitions, examples 5 1.1 Measures of symmetry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.2 Reconstruction from line graphs . . . . . . . . . . . . . . . . . . . . . . . . 8 1.3 Automorphism groups: reduction to 3-connected graphs . . . . . . . . . . . 10 1.4 Automorphism groups of planar graphs . . . . . . . . . . . . . . . . . . . . 11 1.5 Matrix representation. Eigenva...
متن کاملThe reconstruction of maximal planar graphs II. Reconstruction
We assume that the reader is familiar with the work [ 1 ] and with the notation and results of the first paper [3 1. Further terminology used in this paper will be defined as it appears. In the first paper the recognition of maximal planar graphs was established. We now prove further that this class of graphs is indeed reconstructible. We first recall that the following result was proved by Fio...
متن کاملGraph Reconstruction
In 1941 Kelly and Ulam proposed the Graph Reconstruction Conjecture, and it has remained an open problem to this day[3]. The Graph Reconstruction Conjecture states simply that any simple finite undirected graph on 3 or more vertices can be uniquely identified (up to isomorphism) by the multiset of its unlabeled 1-vertex-deleted subgraphs. There are no known counter-examples to the Conjecture, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 97 شماره
صفحات -
تاریخ انتشار 2007